Visual hallucination of coloured numbers secondary to hyperglycaemia
نویسندگان
چکیده
منابع مشابه
Learning and Visual Hallucination
It is generally recognized that learning is a useful tool for solving vision problems. However, at present time, neither learning nor vision is a well understood problem. It is even less clear how one might be able to put the two together. In this paper I will attempt to study one small aspect of this problem of using learning in vision. In particular I will study how learning might be used for...
متن کاملVisual Hallucination For Computational Creation
Research on computational painters usually focuses on simulating rational parts of the generative process. From an art-historic perspective it is plausible to assume that also an arational process, namely visual hallucination, played an important role in modern fine art movements like Surrealism. The present work investigates this connection between creativity and hallucination. Using psycholog...
متن کاملVisual Hull Construction from Semitransparent Coloured Silhouettes
This paper attempts to create coloured semi-transparent shadow images that can be projected onto multiple screens simultaneously from different viewpoints. The inputs to this approach are a set of coloured shadow images and view angles, projection information and light configurations for the final projections. We propose a method to convert coloured semi-transparent shadow images to a 3D visual...
متن کاملEvent-Related Potentials in Parkinson's Disease Patients with Visual Hallucination
Using neuropsychological investigation and visual event-related potentials (ERPs), we aimed to compare the ERPs and cognitive function of nondemented Parkinson's disease (PD) patients with and without visual hallucinations (VHs) and of control subjects. We recruited 12 PD patients with VHs (PD-H), 23 PD patients without VHs (PD-NH), and 18 age-matched controls. All subjects underwent comprehens...
متن کاملMonochromatic tree covers and Ramsey numbers for set-coloured graphs
We extend results on monochromatic tree covers and from classical Ramsey theory to a generalised setting, where each of the edges of an underlying host graph (here, either a complete graph or a complete bipartite graph), is coloured with a set of colours. Our results for tree covers in this setting have an application to Ryser’s Conjecture. Every r-partite r-uniform hypergraph whose edges pairw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Case Reports
سال: 2011
ISSN: 1757-790X
DOI: 10.1136/bcr.08.2010.3268